A task-oriented agent-based mechanism for theorem proving
نویسنده
چکیده
We present an agent-based mechanism that acts as a mediator module between theorem proving systems and mathematical knowledge bases containing information that is necessary for the constructions of proofs. Unlike the more popular user-oriented mediators who work as information agents to provide the so-called value-added services to the collected data before presenting it to users or user applications, our multiagents are more task-oriented. That is, our agents work in tandem with the user or user application on the tasks the user is trying to solve. This approach is particularly suitable to mathematical knowledge retrieval in theorem proving as checking for applicable axioms/definitions/theorems from the knowledge base can be done independently from the proof search process concurrently carried out by the prover, and the prover and the mediator operate on two different search spaces and the search outcome brought about by the mediator can be of great benefit to the prover, e.g. to avoid the prover from exploring many unnecessary or irrelevant proof steps, to keep the prover’s search space more manageable and the constructed proof more comprehensible.
منابع مشابه
A task-oriented agent-based mechanism for mathematical assistant systems
We present an agent-based mechanism that acts as a mediator module between theorem proving systems and mathematical knowledge bases containing information that is necessary for the constructions of proofs. Unlike the more popular user-oriented mediators who work as information agents to provide the so-called value-added services to the collected data before presenting it to users or user applic...
متن کاملA task-oriented agent-based mechanism for mathematical assistant
We present an agent-based mechanism that acts as a mediator module between theorem proving systems and mathematical knowledge bases containing information that is necessary for the constructions of proofs. Unlike the more popular user-oriented mediators who work as information agents to provide the so-called value-added services to the collected data before presenting it to users or user applic...
متن کاملA short introduction to two approaches in formal verification of security protocols: model checking and theorem proving
In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...
متن کاملAgent-Oriented Integration of Distributed Mathematical Services
Real-world applications of automated theorem proving require modern software environments that enable modularisation, networked inter-operability, robustness, and scalability. These requirements are met by the Agent-Oriented Programming paradigm of Distributed Arti cial Intelligence. We argue that a reasonable framework for automated theorem proving in the large regards typical mathematical ser...
متن کاملAgent-Based Distributed Software Verification
Despite decades of research, the takeup of formal methods for developing provably correct software in industry remains slow. One reason for this is the high cost of proof construction, an activity that, due to the complexity of the required proofs, is typically carried out using interactive theorem provers. In this paper we propose an agent-oriented architecture for interactive theorem proving ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003